Theory X and theory Y

Results: 107



#Item
21TABLEAU COMPLEXES ALLEN KNUTSON, EZRA MILLER, AND ALEXANDER YONG A BSTRACT. Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, al

TABLEAU COMPLEXES ALLEN KNUTSON, EZRA MILLER, AND ALEXANDER YONG A BSTRACT. Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, al

Add to Reading List

Source URL: www.math.duke.edu

Language: English - Date: 2006-03-25 02:44:38
22TABLEAU COMPLEXES ALLEN KNUTSON, EZRA MILLER, AND ALEXANDER YONG A BSTRACT. Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, al

TABLEAU COMPLEXES ALLEN KNUTSON, EZRA MILLER, AND ALEXANDER YONG A BSTRACT. Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, al

Add to Reading List

Source URL: www.math.duke.edu

Language: English - Date: 2006-03-25 02:52:15
23Impacts of suppliers’ learning behaviour on market equilibrium under repeated linear supply-function bidding Y.F. Liu, Y.X. Ni and F.F. Wu Abstract: The paper studies the impacts of learning behaviour of electrical-pow

Impacts of suppliers’ learning behaviour on market equilibrium under repeated linear supply-function bidding Y.F. Liu, Y.X. Ni and F.F. Wu Abstract: The paper studies the impacts of learning behaviour of electrical-pow

Add to Reading List

Source URL: www.eee.hku.hk

Language: English - Date: 2012-06-13 00:42:14
24LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION 1. Prove or disprove: For any uncountable well-ordered set (X, <) there is a countable well-ordered set (Y, <) for which (X, <) ≡ (Y, <). 2. Suppose that L i

LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION 1. Prove or disprove: For any uncountable well-ordered set (X, <) there is a countable well-ordered set (Y, <) for which (X, <) ≡ (Y, <). 2. Suppose that L i

Add to Reading List

Source URL: logic.berkeley.edu

Language: English - Date: 2014-08-24 16:43:20
25Week 5: Expected value and Betting systems Random variable A random variable represents a ”measurement” in a random experiment. We usually denote random variable with capital letter X, Y, · · · . If S is the sampl

Week 5: Expected value and Betting systems Random variable A random variable represents a ”measurement” in a random experiment. We usually denote random variable with capital letter X, Y, · · · . If S is the sampl

Add to Reading List

Source URL: people.math.umass.edu

Language: English - Date: 2013-03-03 21:44:11
26THE COLLEGES OF OXFORD UNIVERSITY MATHEMATICS, JOINT SCHOOLS AND COMPUTER SCIENCE Sample Solutions for Specimen Test 1 1. A. The two curves y = x2 and y = x + 2 meet when

THE COLLEGES OF OXFORD UNIVERSITY MATHEMATICS, JOINT SCHOOLS AND COMPUTER SCIENCE Sample Solutions for Specimen Test 1 1. A. The two curves y = x2 and y = x + 2 meet when

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2013-07-08 03:58:42
27Journal of Automata, Languages and Combinatorics u (v) w, x–y Otto-von-Guericke-Universit¨ at Magdeburg Regular Expressions: New Results and Open Problems

Journal of Automata, Languages and Combinatorics u (v) w, x–y Otto-von-Guericke-Universit¨ at Magdeburg Regular Expressions: New Results and Open Problems

Add to Reading List

Source URL: cs.uwaterloo.ca

Language: English - Date: 2011-06-09 07:59:48
28NORDIC MATHEMATICAL CONTEST PROBLEMS AND SOLUTIONS, 1987–2011 PROBLEMS The problems are identified as xy.n., whery x and y are the last digits of the competition year and n is the n:th problem of that year.

NORDIC MATHEMATICAL CONTEST PROBLEMS AND SOLUTIONS, 1987–2011 PROBLEMS The problems are identified as xy.n., whery x and y are the last digits of the competition year and n is the n:th problem of that year.

Add to Reading List

Source URL: www.georgmohr.dk

Language: English - Date: 2011-10-20 11:27:18
29NORDIC MATHEMATICAL CONTEST PROBLEMS AND SOLUTIONS, 1987–2011 PROBLEMS The problems are identified as xy.n., whery x and y are the last digits of the competition year and n is the n:th problem of that year.

NORDIC MATHEMATICAL CONTEST PROBLEMS AND SOLUTIONS, 1987–2011 PROBLEMS The problems are identified as xy.n., whery x and y are the last digits of the competition year and n is the n:th problem of that year.

Add to Reading List

Source URL: www.georgmohr.dk

Language: English - Date: 2011-10-20 10:50:54
30Computability of continuous solutions of higher-type equations Mart´ın Escard´o School of Computer Science, University of Birmingham, UK Abstract. Given a continuous functional f : X → Y and y ∈ Y , we wish

Computability of continuous solutions of higher-type equations Mart´ın Escard´o School of Computer Science, University of Birmingham, UK Abstract. Given a continuous functional f : X → Y and y ∈ Y , we wish

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2009-03-18 06:51:09